Computing Prosodic Morphology

Computing Declarative Prosodic Morphology

This paper describes a computational, declarative approach to prosodic morphology that uses inviolable constraints to denote small finite candidate sets which are filtered by a restrictive incremental optimization mechanism. The new approach is illustrated with an implemented fragment of Modern Hebrew verbs couched in MicroCUF, an expressive constraint logic formalism. For generation and parsin...

Temiar Reduplication in One-Level Prosodic Morphology

Temiar reduplication is a difficult piece of prosodic morphology. This paper presents the first computational analysis of Temiar reduplication, using the novel finite-state approach of One-Level Prosodic Morphology originally developed by Walther (1999b, 2000). After reviewing both the data and the basic tenets of One-level Prosodic Morphology, the analysis is laid out in some detail, using the...

The Prosodic Morphology of Jamaican Creole Iteratives1

The input of a reduplicative word formation process in Jamaican Creole (JC) is restricted prosodically. In this paper, the prosodic restrictions are analyzed in terms of constraints that are generally operative in JC prosody. The study therefore provides empirical support for the Prosodic Morphology Hypothesis of McCarthy & Prince 1986. Investigation of the constraints operative in JC prosody l...

Prosodic Morphology and Templatic Morphology

Finite-State Reduplication in One-Level Prosodic Morphology

Reduplication, a central instance of prosodic morphology, is particularly challenging for state-ofthe-art computational morphology, since it involves copying of some part of a phonological string. In this paper I advocate a finite-state method that combines enriched lexical representations via intersection to implement the copying. The proposal includes a resource-conscious variant of automata ...